Global optimization over a box via canonical dual function
نویسندگان
چکیده
منابع مشابه
Unified canonical duality methodology for global optimization
A unified methodology is presented for solving general global optimization problems. Based on the canonical dualitytriality theory, the nonconvex/nonsmooth/discrete problems from totally different systems are reformulated as a canonical min–max problem, which is equivalent to a monotone variational inequality problem over a convex cone. Therefore, a complementary-dual projection method is used ...
متن کاملA Primal-Relaxed Dual Global Optimization Approach1
A deterministic global optimization approach is proposed for nonconvex constrained nonlinear programming problems. Partitioning of the variables, along with the introduction of transformation variables, if necessary, convert the original problem into primal and relaxed dual subproblems that provide valid upper and lower bounds respectively on the global optimum. Theoretical properties are prese...
متن کاملCanonical Dual Transformation Method and Generalized Triality Theory in Nonsmooth Global Optimization
This paper presents, within a unified framework, a potentially powerful canonical dual transformation method and associated generalized duality theory in nonsmooth global optimization. It is shown that by the use of this method, many nonsmooth/nonconvex constrained primal problems in Rn can be reformulated into certain smooth/convex unconstrained dual problems in Rm with m 6 n and without duali...
متن کاملGlobal Optimization via SPSA
A desire with iterative optimization techniques is that the algorithm reaches the global optimum rather than get stranded at a local optimum value. In this paper, we examine the theoretical and numerical global convergence properties of a certain “gradient free” stochastic approximation algorithm called “SPSA,” that has performed well in complex optimization problems. We establish two theorems ...
متن کاملA New Algorithm for Box-Constrained Global Optimization
An important class of deterministic methods for global optimization is based on the theory of terminal attractors and repellers. Unfortunately, the utilization of scalar repellers is unsuitable, when the dimension n of the problem assumes values of operational interest. In previous papers the author et alii showed that BFSG-type methods, approximating the Hessian of twice continuously different...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2011
ISSN: 0377-0427
DOI: 10.1016/j.cam.2010.07.023